Scenario-dominance to multi-stage stochastic lot-sizing and knapsack problems
نویسندگان
چکیده
منابع مشابه
Dynamic knapsack sets and capacitated lot-sizing
A dynamic knapsack set is a natural generalization of the 0-1 knapsack set with a continuous variable studied recently. For dynamic knapsack sets a large family of facet-defining inequalities, called dynamic knapsack inequalities, are derived by fixing variables to one and then lifting. Surprisingly such inequalities have the simultaneous lifting property, and for small instances provide a sign...
متن کاملScenario Optimization for Multi-Stage Stochastic Programming Problems
The field of multi-stage stochastic programming provides a rich modelling framework to tackle a broad range of real-world decision problems. In order to numerically solve such programs once they get reasonably large the infinite-dimensional optimization problem has to be discretized. The stochastic optimization program generally consists of an optimization model and a stochastic model. In the m...
متن کاملPolynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems
In 1958, Wagner and Whitin published a seminal paper on the deterministic uncapacitated lot-sizing problem, a fundamental model that is embedded in many practical production planning problems. In this paper we consider a basic version of this model in which demands (and other problem parameters) are stochastic: the stochastic uncapacitated lot-sizing problem (SULS). We define the production pat...
متن کاملAlgorithms for Stochastic Lot-Sizing Problems with Backlogging
As a traditional model in the operations research and management science domain, deterministic lot-sizing problem is embedded in many application problems such as production and inventory planning and has been consistently drawing attentions from researchers. In this paper we consider basic versions of lot-sizing models in which problem parameters are stochastic and develop corresponding scenar...
متن کاملOn the Capacitated Lot Sizing and Continuous Knapsack Polyhedra
We consider the single item capacitated lot sizing problem a well known produc tion planning model that often arises in practical applications and derive new classes of valid inequalities for it We also derive new easily computable valid inequalities for the continuous knapsack problem The continuous knapsack problem has been introduced recently and has been shown to provide a useful relaxation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2023
ISSN: ['0305-0548', '1873-765X']
DOI: https://doi.org/10.1016/j.cor.2023.106149